Associative-commutative rewriting via flattening

Associative-Commutative Superposition

We present an associative-commutative paramodulation calculus that generalizes the associativecommutative completion procedure to first-order clauses. The calculus is parametrized by a selection function (on negative literals) and a well-founded ordering on terms. It is compatible with an abstract notion of redundancy that covers such simplification techniques as tautology deletion, subsumption...

Associative-Commutative Rewriting

We are currently extending the rewrite system labora­ tory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associativecommutative systems.

Associative-Commutative Rewriting on Large Terms

Max-planck-institut F Ur Informatik Associative-commutative Superposition K I N F O R M a T I K

We present an associative-commutative paramodulation calculus that generalizes the associativecommutative completion procedure to rst-order clauses. The calculus is parametrized by a selection function (on negative literals) and a well-founded ordering on terms. It is compatible with an abstract notion of redundancy that covers such simpli cation techniques as tautology deletion, subsumption, a...

Monomial Orderings, Rewriting Systems, and Gröbner Bases for the Commutator Ideal of a Free Algebra

In this paper we consider a free associative algebra on three generators over an arbitrary field K. Given a term ordering on the commutative polynomial ring on three variables over K, we construct uncountably many liftings of this term ordering to a monomial ordering on the free associative algebra. These monomial orderings are total well orderings on the set of monomials, resulting in a set of...